On computing Boolean connectives of characteristic functions
نویسندگان
چکیده
منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
We consider new complexity measures for the model of multilinear circuits with general multilinear gates introduced by Goldreich and Wigderson (ECCC, 2013). These complexity measures are related to the size of canonical constant-depth Boolean circuits, which extend the definition of canonical depth-three Boolean circuits. We obtain matching lower and upper bound on the size of canonical constan...
متن کاملBoolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic (D) called Boolean dependence logic (BD). In BD dependence atoms are of the type =(x1, . . . , xn, α), where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of BD to D and first-orde...
متن کاملApproximation of non-Boolean functions by Boolean functions and applications in non-standard computing
Abstract We survey the research and we report new results related to the relationships that exist between Boolean and nonBoolean functions defined on Boolean algebras. The results included here are relevant for set-valued logic that is useful in several non-standard types of circuits: interconnectionfree biomolecular devices, devices based on optical wavelength multiplexing, etc. We extend our ...
متن کاملOn canalizing Boolean functions
Boolean networks are an important model of gene regulatory networks in systems and computational biology. Such networks have been widely studied with respect to their stability and error tolerance. It has turned out that canalizing Boolean functions and their subclass, the nested canalizing functions, appear frequently in such networks. These classes have been shown to have a stabilizing effect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1995
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01303054